Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(1) |
→ f(g(1)) |
| 2: |
|
f(f(x)) |
→ f(x) |
| 3: |
|
g(0) |
→ g(f(0)) |
| 4: |
|
g(g(x)) |
→ g(x) |
|
There are 4 dependency pairs:
|
| 5: |
|
F(1) |
→ F(g(1)) |
| 6: |
|
F(1) |
→ G(1) |
| 7: |
|
G(0) |
→ G(f(0)) |
| 8: |
|
G(0) |
→ F(0) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006